Prize-collecting steiner network problems
نویسندگان
چکیده
منابع مشابه
On Euclidean Prize-collecting Steiner Forest Problems
In this paper, we consider prize-collecting Steiner forest and k-Steiner forest when the vertices of the input graph are points in the Euclidean plane and the lengths are Euclidean distances. First, we simplify the analysis of the polynomial-time approximation scheme (PTAS) of Borradaile et al. [7, 8] for the Euclidean Steiner forest problem. This is done by proving a new structural property an...
متن کاملElementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G= (V ,E), a collection T = {T1, . . . , Tk}, each a subset of V of size at least 2, a weight function w :E → R+, and a penalty function p :T → R+. The goal is to find a forest F that minimizes the cost of the edges of F plus the penalt...
متن کاملNear-Optimal Online Algorithms for Prize-Collecting Steiner Problems
In this paper, we give the first online algorithms with a polylogarithmic competitive ratio for the node-weighted prize-collecting Steiner tree and Steiner forest problems. The competitive ratios are optimal up to logarithmic factors. In fact, we give a generic technique for reducing online prize-collecting Steiner problems to the fractional version of their non-prize-collecting counterparts lo...
متن کاملExact approaches for solving robust prize-collecting Steiner tree problems
In the Prize-Collecting Steiner Tree Problem (PCStT) we are given a set of customers with potential revenues and a set of possible links connecting these customers with fixed installation costs. The goal is to decide which customers to connect into a tree structure so that the sum of the link costs plus the revenues of the customers that are left out is minimized. The problem, as well as some o...
متن کاملA Prize-Collecting Steiner Tree Approach for Transduction Network Inference
Into the cell, information from the environment is mainly propagated via signaling pathways which form a transduction network. Here we propose a new algorithm to infer transduction networks from heterogeneous data, using both the protein interaction network and expression datasets. We formulate the inference problem as an optimization task, and develop a message-passing, probabilistic and distr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2012
ISSN: 1549-6325,1549-6333
DOI: 10.1145/2390176.2390178